Partitions with Rounded Occurrences and Attached Parts

نویسنده

  • JEREMY LOVEJOY
چکیده

We introduce the number of (k, i)-rounded occurrences of a part in a partition and use q-difference equations to interpret a certain q-series Sk,i(a;x; q) as the generating function for partitions with bounded (k, i)-rounded occurrences and attached parts. When a = 0 these partitions are the same as those studied by Bressoud in his extension of the Rogers-RamanujanGordon identities to even moduli. When a = 1/q we obtain a new family of partition identities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partitions and Overpartitions with Attached Parts

We show how to interpret a certain q-series as a generating function for overpartitions with attached parts. A number of families of partition theorems follow as corollaries.

متن کامل

Overpartition Theorems of the Rogers-ramanujan Type

We give one-parameter overpartition-theoretic analogues of two classical families of partition identities: Andrews’ combinatorial generalization of the Gollnitz-Gordon identities and a theorem of Andrews and Santos on partitions with attached odd parts. We also discuss geometric counterparts arising from multiple q-series identities. These involve representations of overpartitions in terms of g...

متن کامل

Enumeration of Partitions by Long Rises, Levels, and Descents

When the partitions of [n] = {1, 2, . . . , n} are identified with the restricted growth functions on [n], under a known bijection, certain enumeration problems for classical word statistics are formulated for set partitions. In this paper we undertake the enumeration of partitions of [n] with respect to the number of occurrences of rises, levels and descents, of arbitrary integral length not e...

متن کامل

Term Partitions and Minimal Generalizations of Clauses

Term occurrences of any clause C are determined by their positions. The set of all term partitions defined on subsets of term occurrences of C form a partially ordered set. This poset is isomorphic to the set of all generalizations of C. The structure of this poset can be inferred from the term occurrences in C alone. We can apply these constructions in this poset in machine learning.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009